Can groups solve the problem of over-bidding in contests?
نویسندگان
چکیده
This study reports an experiment that examines whether groups can better comply with theoretical predictions than individuals in contests. Our experiment replicates previous findings that individual players significantly overbid relative to theoretical predictions, incurring substantial losses. There is high variance in individual bids and strong heterogeneity across individual players. The new findings of our experiment are that groups make 25% lower bids, their bids have lower variance, and group bids are less heterogeneous than individual bids. Therefore, groups receive significantly higher and more homogeneous payoffs than individuals. We elicit individual and group preferences towards risk using simple lotteries. The results indicate that groups make less risky decisions, which is a possible explanation for lower bids in contests. Most importantly, we find that groups learn to make lower bids from communication and negotiation between group members. JEL Classifications: C72, C91, C92, D72
منابع مشابه
An Optimization Framework for Combining the Petroleum Replenishment Problem with the Optimal Bidding in Combinatorial Auctions
We address in this paper a periodic petroleum station replenishment problem (PPSRP) that aims to plan the delivery of petroleum products to a set of geographically dispatched stations. It is assumed that each station is characterized by its weekly demand and by its frequency of service. The main objective of the delivery process is to minimize the total travelled distance by the vailable trucks...
متن کاملStrategic Bidding in a Pool-Based Electricity Market under Load Forecast Uncertainty
This paper proposes a method for determining the price bidding strategies of market participants consisting of Generation Companies (GENCOs) and Distribution Companies (DISCOs) in a day-ahead electricity market, while taking into consideration the load forecast uncertainty and demand response programs. The proposed algorithm tries to find a Pareto optimal point for a risk neutral participan...
متن کاملPrice-takers’ bidding strategies in joint energy and spinning reserve pay-as-bid markets
Strategic bidding in joint energy and spinning reserve markets is a challenging task from the viewpoint of generation companies (GenCos). In this paper, the interaction between energy and spinning reserve markets is modeled considering a joint probability density function for the prices of these markets. Considering pay-as-bid pricing mechanism, the bidding problem is formulated and solved as a...
متن کاملA Comprehensive Survey on GenCos’ Optimal Bidding Strategy Problem in Competitive Power Markets
This paper represents a complete survey on Generation Companies’ (GenCos’) optimal bidding strategy problem in restructured power markets. In this regard after an introduction to competitive electricity markets, concept of optimal bidding strategy is presented. Considering large amount of works accomplished in this area a novel classification is implemented in order to categorize the existing d...
متن کاملA New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm
Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Social Choice and Welfare
دوره 35 شماره
صفحات -
تاریخ انتشار 2010